The Jal triangulation: An adaptive triangulation in any dimension
نویسندگان
چکیده
Spatial sampling methods have acquired great popularity due to the number of applications that need to triangulate portions of space in various dimensions. One limitation of the current techniques is the handling of the final models, which are large, complex and need to register neighborhood relationships explicitly. Additionally, most techniques are limited to Euclidean bidimensional or tridimensional spaces and many do not handle well adaptive refinement. This work presents a novel method for spatial decomposition based on simplicial meshes (the J 1 triangulation) that is generally defined for Euclidean spaces of any dimension and is intrinsically adaptive. Additionally it offers algebraic mechanisms for the decomposition itself and for definition of neighbrs that allow to recover all the information on the resulting mesh via a set of rules. This way it is possible to balance the cost of storage and manipulation by calculating the needed information instead of storing it. Results additionally show good quality meshes with efficient calculation.
منابع مشابه
The Study of Triangulation Forms and Their Relationship with Parenting Styles among Families in Yazd
Introduction: The family provides the first seed of human development and personality development. The child learns ethical principles and social relationships with others in the family. So it is important to know what relationships are in the parents’ family and how they raise their children. The main purpose of this study was to investigate triangulation forms and their relationship with pare...
متن کاملShape Dimension and Intrinsic Metric from Samples of Manifolds
We introduce the adaptive neighborhood graph as a data structure for modeling a smooth manifold M embedded in some Euclidean space . We assume that M is known to us only through a finite sample P ⊂ M , as it is often the case in applications. The adaptive neighborhood graph is a geometric graph on P . Its complexity is at most min{2O(k)n, n2}, where n = |P | and k = dim M , as opposed to the n ...
متن کاملAn efficient implementation of Delaunay triangulations in medium dimensions
We propose a new C++ implementation of the well-known incremental algorithm for the construction of Delaunay triangulations in any dimension. Our implementation follows the exact computing paradigm and is fully robust. Extensive comparisons have shown that our implementation outperforms the best currently available codes for convex hulls and Delaunay triangulations, and that it can be used for ...
متن کاملAdaptive Triangulation Methods for Bivariate Spline Solutions of the Poisson Equation
We report numerical performance of self-adaptive triangulation approach to improve numerical solutions of Poisson equations using bivariate spline functions. Starting with a uniform triangulation, we use the gradient values of an initial spline solution to generate an updated triangulation. Both refining and coarsening the initial triangulation are combined together and a global triangulation i...
متن کاملAdaptive Solution of Steady Two Dimensional Flow on an Unstructured Grid
Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roe's flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 30 شماره
صفحات -
تاریخ انتشار 2006